On the L1-Condition Number of the Univariate Bernstein Basis
نویسندگان
چکیده
We show that the size of the 1-norm condition number of the univariate Bernstein basis for polynomials of degree n is O(2n/ √ n). This is consistent with known estimates [3], [5] for p = 2 and p = ∞ and leads to asymptotically correct results for the p-norm condition number of the Bernstein basis for any p with 1 ≤ p ≤ ∞.
منابع مشابه
Addendum to ”On the L1-Condition Number of the Univariate Bernstein Basis”
The paper mentioned above is a contribution of the authors to volume 18(2002) of this journal, see [1] . Recently J. Domsta pointed out to us that the proof of Theorem 4.2 in that paper contains an error. The purpose of this note is to present a correct argument for it. §
متن کاملNumerical resolution of large deflections in cantilever beams by Bernstein spectral method and a convolution quadrature.
The mathematical modeling of the large deflections for the cantilever beams leads to a nonlinear differential equation with the mixed boundary conditions. Different numerical methods have been implemented by various authors for such problems. In this paper, two novel numerical techniques are investigated for the numerical simulation of the problem. The first is based on a spectral method utiliz...
متن کاملNumerical solution of nonlinear Hammerstein integral equations by using Legendre-Bernstein basis
In this study a numerical method is developed to solve the Hammerstein integral equations. To this end the kernel has been approximated using the leastsquares approximation schemes based on Legender-Bernstein basis. The Legender polynomials are orthogonal and these properties improve the accuracy of the approximations. Also the nonlinear unknown function has been approximated by using the Berns...
متن کاملNew operational matrix for solving a class of optimal control problems with Jumarie’s modified Riemann-Liouville fractional derivative
In this paper, we apply spectral method based on the Bernstein polynomials for solving a class of optimal control problems with Jumarie’s modified Riemann-Liouville fractional derivative. In the first step, we introduce the dual basis and operational matrix of product based on the Bernstein basis. Then, we get the Bernstein operational matrix for the Jumarie’s modified Riemann-Liouville fractio...
متن کاملDivision algorithms for Bernstein polynomials
Three division algorithms are presented for univariate Bernstein polynomials: an algorithm for finding the quotient and remainder of two univariate polynomials, an algorithm for calculating the GCD of an arbitrary collection of univariate polynomials, and an algorithm for computing a μ-basis for the syzygy module of an arbitrary collection of univariate polynomials. Division algorithms for mult...
متن کامل